Lattice and QR Decomposition-Based Algorithms for Recursive Least Squares Adaptive Nonlinear Filters*
نویسنده
چکیده
This paper presents a lattice structure for adaptive Volterra systems. The stucture is applicable to arbitrary planes of support of the Volterra kernels. A fast least squares lattice and a fast QR-lattice adaptive nonlinear filtering algorithms based on the lattice structure are also presented. These algorithms share the fast convergence property of fast least squares transversal Volterra filters; however, unlike the transversal filters they do not suffer from numerical instability.
منابع مشابه
QR-decomposition-based least-squares lattice interpolators
QR-decomposition-based least-squares lattice (QRD-LSL) predictors have been extensively applied in the design of order-recursive adaptive filters. This work presents QRD-LSL interpolators that use both past and future data samples to estimate the present data sample based on a novel decoupling property. We show that the order-recursive QRD-LSL interpolators display better numerical properties a...
متن کاملInterpolation Lattice Filters for Narrowband Interference Cancellation in PN Spread Spectrum Communication Systems
Previous work on the adaptive lattice filters for narrowband interference rejection in a direct sequence (DS) spread spectrum communication system has centered around the use of one-sided prediction only. For two-sided interpolation, that is known to achieve better interference rejection than its one-sided counterpart, only the least-mean-squared (LMS) algorithms have been considered thus far i...
متن کاملApproximate QR-Based Algorithms for Recursive Nonlinear Least Squares Estiamtion
This paper proposes new approximate QR-based algorithms for recursive nonlinear least squares (NLS) estimation. Two QR decomposition-based recursive algorithms are introduced based on the classical Gauss-Newton (GN) and Levenberg-Marquardt (LM) algorithms in nonlinear unconstrained optimization or least squares problems. Instead of using the matrix inversion formula, recursive QR decomposition ...
متن کاملAlgorithms and Architectures for Split Recursive Least Squares
In this paper, a new computationally efficient algorithm for recursive least-squares (RLS) filtering is presented. The proposed Split RLS algorithm can perform the approximated RLS with O ( N ) complexity for signals having no special data structure t o be exploited. Our performance analysis shows that the estimation bias will be small when the input data are less correlated. We also show that ...
متن کاملNew fast QR decomposition least squares adaptive algorithms
This paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obtained via a QR decomposition (QRD). Both algorithms are of O(p) computational complexity, with p being the order of the system. The first algorithm is a fixed order QRD scheme with...
متن کامل